-
1 lattice permutation
Большой англо-русский и русско-английский словарь > lattice permutation
-
2 lattice permutation
Математика: решеточная перестановка -
3 lattice permutation
-
4 permutation
1) изменение; перемена2) перемещение; перестановка || перестановочный3) пермутация, перестановка4) размещение• -
5 решеточная перестановка
Большой англо-русский и русско-английский словарь > решеточная перестановка
-
6 group
1) группа, ансамбль || групповой- roughing mill group2) совокупность; комплект3) группировка || группировать(ся)5) класс; категория || классифицировать; категоризировать6) хим. остаток7) сгусток; скопление8) узел9) матем. группа- absolute free group - absolute homotopy group - absolutely irreducible group - absolutely simple group - additively written group - adele group - adelic group - algebraically compact group - algebraically simple group - almost connected group - almost cyclic group - almost ordered group - almost periodic group - almost simple group - alternating form group - cancellative group - cellular homology group - characteristically simple group - complementing group - completely anisotropic group - completely discontinuous group - completely divisible group - completely indecomposable group - completely integrally closed group - deficient group - direct homology group - direct indecomposable group - doubly transitive group - finitely defined group - finitely generated group - finitely presented group - finitely related group - first homology group - first homotopy group - freely generated group - full linear group - full orthogonal group - full rotation group - full symmetric group - full unimodular group - group of classes of algebras - group of covering transformations - group of finite rank - group of infinite order - group of infinite rank - group of inner automorphisms - group of linear equivalence - group of linear forms - group of linear manifold - group of principal ideles - group of real line - group of recursive permutations - group of right quotients - idele class group - linearly ordered group - linearly transitive group - locally bicompact group - locally closed group - locally compact group - locally connected group - locally cyclic group - locally defined group - locally embeddable group - locally finite group - locally free group - locally infinite group - locally nilpotent group - locally normal group - locally solvable group - multiply primitive group - multiply transitive group - nonsolvable group - n-th homotopy group - ordered pair group - principal congruence group - properly orthogonal group - properly unimodular group - pure projective group - pure rotation group - pure simple group - quasipure projective group - quotient divisible group - residually nilpotent group - restricted holonomy group - sharply transitive group - simply ordered group - simply reducible group - simply transitive group - singular cogomology group - singular homology group - solvable group - stable group - strictly transitive group - strongly polycyclic group - subsolvable group - supersolvable group - totally ordered group - totally projective group - totally reducible group - triply transitive group - unitary symmetry group - unitary transformation group - value group - weak homology group - weakly mixing groupgroup with multiple operators — группа с многоместными операторами, мультиоператорная группа
-
7 graph
1) граф2) график || строить график3) диаграмма || чертить диаграмму•- alternating composition graph - arbitrarily transversable graph - derived graph - doubly connected graph - doubly transitive graph - fully connected graph - locally countable graph - locally finite graph - locally restricted graph - log-log graph - partially labeled graph - partially orderable graph - progressively finite graph - regressively finite graph - strictly weak graph - strongly orientable graph - strongly regular graph - strongly rigid graph - strongly singular graph - strongly smooth graph - totally inductive graph - triangleless graph - triply transitive graph - uniquely intersectable graph - uniquely representable graph - weakly disconnected graph -
8 distribution
1) распределение; распространение; раздача2) стат. распределение (вероятностей), закон распределения3) размещение, расположение4) разводка (напр., кабельных соединений)5) разделение, классификация6) зоол. ареал (область обитания какого-л. организма на земной поверхности)7) мех. эпюра8) полигр. разбор ( шрифта)9) растир, раскат ( краски)•distribution on a sphere —распределение на сфере
distribution truncated at both ends — распределение, усечённое с обеих сторон
distribution truncated at one end — распределение, усечённое с одной стороны
-
9 operation
1) действие2) операция3) оперирование4) процесс, ход5) работа, функционирование6) срабатывание7) управление8) эксплуатация•- hereditarily recursive operationoperation under VFR — авиац. визуальное самолётовождение
-
10 problem
1) задача; проблема3) трудность, затруднение•- boundary value problem - card matching problem - central limit problem - decision problem under risk - decision problem under uncertainty - extremum problem - fair division problem - gambling problem - gasoline blending problem - incompletely structured problem - optimal path problem - optimal stopping problem - portfolio selection problem - precisely specified problem - recursively solvable problem - sequential decision programming problem - sequential occupancy problem - shortest path problem - shortest route problem - standard control problem - three houses and three wells problem
См. также в других словарях:
Integer lattice — In mathematics, the n dimensional integer lattice (or cubic lattice), denoted Zn, is the lattice in the Euclidean space Rn whose lattice points are n tuples of integers. The two dimensional integer lattice is also called the square lattice, or… … Wikipedia
E₈ lattice — In mathematics, the E8 lattice is a special lattice in R8. It can be characterized as the unique positive definite, even, unimodular lattice of rank 8. The name derives from the fact that it is the root lattice of the E8 root system. The normIn… … Wikipedia
Post's lattice — In logic and universal algebra, Post s lattice denotes the lattice of all clones on a two element set {0, 1}, ordered by inclusion. It is named for Emil Post, who published a complete description of the lattice in 1941 [E. L. Post, The two valued … Wikipedia
Littlewood–Richardson rule — In mathematics, especially in the area of algebra known as the representation theory and in the area of algebraic combinatorics dealing with Young tableaux and symmetric polynomials, the Littlewood–Richardson rule is a combinatorial description… … Wikipedia
Maximal subgroup — Lattice of subgroups of the symmetric group S4 M. s. are A4, three Dih4 and four S3 (Compare: Subgroups of S … Wikipedia
List of finite simple groups — In mathematics, the classification of finite simple groups states thatevery finite simple group is cyclic, or alternating, or in one of 16 families of groups of Lie type (including the Tits group, which strictly speaking is not of Lie type),or… … Wikipedia
Feynman diagram — The Wick s expansion of the integrand gives (among others) the following termNarpsi(x)gamma^mupsi(x)arpsi(x )gamma^ upsi(x )underline{A mu(x)A u(x )};,whereunderline{A mu(x)A u(x )}=int{d^4pover(2pi)^4}{ig {mu u}over k^2+i0}e^{ k(x x )}is the… … Wikipedia
Mathieu group — Group theory Group theory … Wikipedia
Boolean algebras canonically defined — Boolean algebras have been formally defined variously as a kind of lattice and as a kind of ring. This article presents them more neutrally but equally formally as simply the models of the equational theory of two values, and observes the… … Wikipedia
Root system — This article discusses root systems in mathematics. For root systems of plants, see root. Lie groups … Wikipedia
Equivalence relation — In mathematics, an equivalence relation is a binary relation between two elements of a set which groups them together as being equivalent in some way. Let a , b , and c be arbitrary elements of some set X . Then a b or a ≡ b denotes that a is… … Wikipedia